D3-Tree: A Dynamic Deterministic Decentralized Structure
نویسندگان
چکیده
We present D-Tree, a dynamic deterministic structure for data management in decentralized networks, by engineering and further extending an existing decentralized structure. D-Tree achieves O(logN) worst-case search cost (N is the number of nodes in the network),O(logN) amortized load-balancing cost, and it is highly fault-tolerant. A particular strength of D-Tree is that it achieves O(logN) amortized search cost under massive node failures. We conduct an extensive experimental study verifying that D-Tree outperforms other well-known structures and that it achieves a significant success rate in element queries in case of massive
منابع مشابه
D3-Tree: A Dynamic Distributed Deterministic Load - Balancer for decentralized tree structures
In this work, we propose D-Tree, a dynamic distributed deterministic structure for data management in decentralized networks. We present in brief the theoretical algorithmic analysis, in which our proposed structure is based on, and we describe thoroughly the key aspects of the implementation. Conducting experiments, we verify that the implemented structure outperforms other well-known hierarch...
متن کاملD2-Tree: A New Overlay with Deterministic Bounds
We present a new overlay, called theDeterministic Decentralized tree (D-tree). TheD-tree compares favourably to other overlays for the following reasons: (a) it provides matching and better complexities, which are deterministic for the supported operations; (b) the management of nodes (peers) and elements are completely decoupled from each other; and (c) an efficient deterministic load-balancin...
متن کاملART ^+ + : A Fault-Tolerant Decentralized Tree Structure with Ultimate Sub-logarithmic Efficiency
In this paper, we focus on large-scale, decentralized environments. Our aim is to develop an architecture that can support range queries and scale in terms of number of nodes as well as of data items stored. The solutions proposed in literature are inadequate for our purposes, since their classic logarithmic complexity is too expensive even for single queries. In this work, we contribute the AR...
متن کاملA Formalism for Dynamic Programming
We introduce a formal structure for dynamic programming that associates a unique dynamic programming functional equation to every deterministic, separable decision tree representation of the underlying problem. Since, in general, the computational complexity of the resulting functional equation depends on the decision tree chosen, the art of dynamic programming is shown to lie in the choice of ...
متن کاملDistributed B-Tree with Weak Consistency
B-tree is a widely used data-structure indexing data for efficient Retrieval. We consider a decentralized B-tree, were parts of the structure are distributed among different processors and some parts are replicated, thus providing a decentralized indexing structure and parallel operations as desired by modern-day cloud computing platforms. To accommodate the dynamic changes due to data insertio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015